WHEN IS THE AUTOMORPHISM GROUP OF A VIRTUALLY POLYCYCLIC GROUP VIRTUALLY POLYCYCLIC?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Fundamental Group of a Compact Flat Lorentz Space Form Is Virtually Polycyclic

A flat Lorentz space form is a geodesically complete Lorentzian manifold of zero curvature. It is well known (see Auslander & Markus [3]) that such a space M may be represented as a quotient R/Γ, where R" is an ^-dimensional Minkowski space (n equals the dimension of M) and Γ is a group of Lorentz isometries acting properly discontinuously and freely on R. In particular the universal covering o...

متن کامل

Knowledge transformation among virtually-cooperating group members

Purpose – The purpose of this paper is to present how in a virtual setting a cooperating group of individuals could transform their tacit knowledge, and what is the necessary infrastructure needed for such transformation. Design/methodology/approach – The paper highlights the different perspectives on knowledge as well as its classification and perception by researcher’s to-date. It also examin...

متن کامل

A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach

This paper presents a formal design for a novel group communication service targeted for wide-area networks (WANs). The service provides virtual synchrony semantics. Such semantics facilitate the design of fault tolerant distributed applications. The presented design is more suitable for WANs than previously suggested ones. In particular, it features the first algorithm to achieve virtual synch...

متن کامل

When is a Graph Product of Groups Virtually-Free?

Those graph products of groups that are virtually-free are characterized.

متن کامل

THE AUTOMORPHISM GROUP OF FINITE GRAPHS

Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Glasgow Mathematical Journal

سال: 2003

ISSN: 0017-0895,1469-509X

DOI: 10.1017/s0017089503001423